The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
نویسندگان
چکیده
منابع مشابه
The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time
In this paper, we address the two-stage assembly flowshop scheduling problem with a weighted sum of makespan and mean completion time criteria, known as bicriteria. Since the problem is NP-hard, we propose heuristics to solve the problem. Specifically, we propose three heuristics; simulated annealing (SA), ant colony optimization (ACO), and self-adaptive differential evolution (SDE). We have co...
متن کاملHeuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration
Recently, both the learning effect scheduling and re-entrant scheduling have received more attention separately in research community. However, the learning effect concept has not been introduced into re-entrant scheduling in the environment setting. To fill this research gap, we investigate re-entrant permutation flowshop scheduling with a position-based learning effect to minimize the total c...
متن کاملA Two-Phase Constructive Heuristic for Permutation Flow-Shop Scheduling Problem Minimizing Total Completion Time
This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the criterion of minimizing total completion time. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A new ranking method is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computat...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملThree-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times
The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2017
ISSN: 0305-0548
DOI: 10.1016/j.cor.2017.07.012